Engines from continuations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Engines From Continuations

Engines provide the means for a computation to be run for a limited period of time, interrupted if it does not complete in that time, and later restarted from the point of interruption. Previous work on engines demonstrated that engines can be implemented by defining a new interpreter to support them. This article demonstrates that engines may be defined in terms of continuations and timer inte...

متن کامل

Yield Continuations

Just as a traditional continuation represents the rest of a computation from a given point in the computation, a subcontinuation represents the rest of a subcomputation from a given point in the subcomputation. Subcontinuations are more expressive than traditional continuations and have been shown to be useful for controlling tree-structured concurrency, yet they have previously been implemente...

متن کامل

Nanoparticle Emissions from Engines

Recently concerns about possible increases in emissions of ultrafine and nanoparticles and their environmental impact have been voiced. A major problem with assessing the significance of such emissions is that, unlike the carbonaceous soot particles associated with older Diesel engines, many of these particles are not formed in the engine but instead by gas-to-particle conversion processes from...

متن کامل

Continuations and Functional Equations

The first part of this writeup gives Riemann’s argument that the completion of zeta, Z(s) = π−s/2Γ(s/2)ζ(s), Re(s) > 1 has a meromorphic continuation to the full s-plane, analytic except for simple poles at s = 0 and s = 1, and the continuation satisfies the functional equation Z(s) = Z(1− s), s ∈ C. The continuation is no longer defined by the sum. Instead, it is defined by a wellbehaved integ...

متن کامل

Compiling ATL with Continuations

This paper presents a proposal to use continuations as an implementation mechanism for ATL. We introduce the notion of continuation, showing its applicability to model-to-model transformations, and develop a simple mechanism to enable continuations in model transformations. Then, the declarative part of ATL is mapped to this mechanism.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Languages

سال: 1989

ISSN: 0096-0551

DOI: 10.1016/0096-0551(89)90018-0